On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs
نویسندگان
چکیده
This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graphs. We construct dominating sets of generalized de Bruijn digraphs where obtained dominating sets have some qualifications. For generalized Kautz digraphs, there is a minimum dominating set in those constructed dominating sets. 2003 Elsevier Science B.V. All rights reserved.
منابع مشابه
Rainbow Domination in Generalized de Bruijn Digraphs
In this paper, we are concerned with the krainbow domination problem on generalized de Bruijn digraphs. We give an upper bound and a lower bound for the k-rainbow domination number in generalized de Bruijn digraphs GB(n, d). We also show that γrk(GB(n, d)) = k if and only if α 6 1, where n = d+α and γrk(GB(n, d)) is the k-rainbow domination number of GB(n, d).
متن کاملReinforcement numbers of digraphs
The reinforcement number of a graph G is the minimum cardinality of a set of extra edges whose addition results in a graph with domination number less than the domination number of G. In this paper we consider this parameter for digraphs, investigate the relationship between reinforcement numbers of undirected graphs and digraphs, and obtain further results for regular graphs. We also determine...
متن کاملIsomorphic factorization, the Kronecker product and the line digraph
In this paper, we investigate isomorphic factorizations of the Kronecker product graphs. Using these relations, it is shown that (1) the Kronecker product of the d-out-regular digraph and the complete symmetric digraph is factorized into the line digraph, (2) the Kronecker product of the Kautz digraph and the de Bruijn digraph is factorized into the Kautz digraph, (3) the Kronecker product of b...
متن کاملOn the power domination number of de Bruijn and Kautz digraphs
Let G = (V,A) be a directed graph without parallel arcs, and let S ⊆ V be a set of vertices. Let the sequence S = S0 ⊆ S1 ⊆ S2 ⊆ · · · be defined as follows: S1 is obtained from S0 by adding all out-neighbors of vertices in S0. For k > 2, Sk is obtained from Sk−1 by adding all vertices w such that for some vertex v ∈ Sk−1, w is the unique out-neighbor of v in V \ Sk−1. We set M(S) = S0 ∪S1 ∪ · ...
متن کاملOn Restricted Arc-connectivity of Regular Digraphs
The restricted arc-connectivity λ′ of a strongly connected digraph G is the minimum cardinality of an arc cut F in G such that every strongly connected component of G−F contains at least two vertices. This paper shows that for a d-regular strongly connected digraph with order n and diameter k ≥ 4, if λ′ exists, then λ′(G) ≥ min { (n − dk−1)(d− 1) dk−1 + d− 2 , 2d− 2 } As consequences, the restr...
متن کامل